منابع مشابه
On probabilistic analog automata
We consider probabilistic automata on a general state space and study their computational power. The model is based on the concept of language recognition by probabilistic automata due to Rabin [20] and models of analog computation in a noisy environment suggested by Maass and Orponen [12], and Maass and Sontag [13]. Our main result is a generalization of Rabin’s reduction theorem that implies ...
متن کاملOn probabilistic pushdown automata
We study the most important probabilistic computation modes for pushdown automata. First we show that deterministic pushdown automata (pda) are weaker than Las Vegas pda, which in turn are weaker than one-sided-error pda. Next one-sidederror pda are shown to be weaker than (nondeterministic) pda. Finally bounded error two-sided error pda and nondeterministic pda are incomparable. To show the li...
متن کاملNotes on Learning Probabilistic Automata
Alberto Apostolico y Probabilistic models of various classes of sources are developed in the context of coding and compression as well as in machine learning and classi cation. In the rst domain, the repetitive structures of substrings are regarded as redundancies and sought to be removed. In the second, repeated subpatterns are unveiled as carriers of information and structure. In both context...
متن کاملDeciding Simulations on Probabilistic Automata
Probabilistic automata are a central model for concurrent systems exhibiting random phenomena. This paper presents, in a uniform setting, efficient decision algorithms for strong simulation on probabilistic automata, but with subtly different results. The algorithm for strong probabilistic simulation is shown to be of polynomial complexity via a reduction to LP problem, while the algorithm for ...
متن کاملOn Probabilistic Kleene Algebras, Automata and Simulations
We show that a class of automata modulo simulation equivalence forms a model of probabilistic Kleene algebra. We prove completeness of this model with respect to continuous probabilistic Kleene algebras. Hence an identity is valid in continuous probabilistic Kleene algebras if and only if the associated automata are simulation equivalent.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(04)00144-6